NS2: Networked Searchable Store with Correctness
نویسندگان
چکیده
In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequent conjunctive keyword searches for matching documents. The protocols provide full computational privacy, query correctness assurances and no leaks: the server either correctly executes client queries or (if it behaves maliciously) is immediately detected. The client is then provided with strong assurances proving the authenticity and completeness of results. This is different from existing secure keyword search research efforts where a cooperating, non-malicious server behavior is assumed. Additionally, not only does the oblivious search protocol conceal the outsourced data (from the un-trusted server) but it also does not leak client access patterns, the queries themselves, the association between different queries or between newly added documents and their corresponding keywords (not even in encrypted form). These assurances come at the expense of additional computation costs which we analyze in the context of today’s hardware.
منابع مشابه
A Networked Dataflow Simulation Environment for Signal Processing and Data Mining Applications
Title of thesis: A NETWORKED DATAFLOW SIMULATION ENVIRONMENT FOR SIGNAL PROCESSING AND DATA MINING APPLICATIONS Stephen Won, Master of Science, 2012 Thesis directed by: Professor Shuvra Bhattacharyya Department of Electrical and Computer Engineering University of Maryland at College Park In networked signal processing systems, dataflow graphs can be used to describe the processing on individual...
متن کاملSESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملOn the Correctness of Inverted Index Based Public-Key Searchable Encryption Scheme for Multi-time Search
In this short note we argue that the state-of-art inverted index based public key searchable encryption scheme proposed by Wang et al may not be completely correct by giving a counterexample.
متن کاملA Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods
Searchable encryption technique enables the users to securely store and search their documents over the remote semitrusted server, which is especially suitable for protecting sensitive data in the cloud. However, various settings (based on symmetric or asymmetric encryption) and functionalities (ranked keyword query, range query, phrase query, etc.) are often realized by different methods with ...
متن کاملIO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality
Free cloud-based services are powerful candidates for deploying ubiquitous encryption for messaging. In the case of email and increasingly chat, users expect the ability to store and search their messages persistently. Using data from one of the top three mail providers, we confirm that for a searchable encryption scheme to scale to millions of users, it should be highly IO-efficient (locality)...
متن کامل